Equivalence Relations on Separated Nets Arising from Linear Toral Flows
نویسندگان
چکیده
In 1998, Burago-Kleiner and McMullen independently proved the existence of separated nets in R which are not bi-Lipschitz equivalent (BL) to a lattice. A finer equivalence relation than BL is bounded displacement after dilation (BDD). Separated nets arise naturally as return times to a section for minimal R-actions. We analyze the separated nets which arise via these constructions, focusing particularly on nets arising from linear R-actions on tori. We show that generically these nets are BL to a lattice, and for some choices of dimensions and sections, they are generically BDD to a lattice. We also show the existence of such nets which are not BDD to a lattice.
منابع مشابه
00 7 CANONICAL EQUIVALENCE RELATIONS ON NETS OF PS c 0
We give a list of canonical equivalence relations on discrete nets of the positive unit sphere of c0. This generalizes results of W. T. Gowers [1] and A. D. Taylor [5].
متن کاملCanonical Equivalence Relations on Nets
We give a list of canonical equivalence relations on discrete nets of the positive unit sphere of c0. This generalizes results of W. T. Gowers [1] and A. D. Taylor [5].
متن کاملNETS AND SEPARATED S-POSETS
Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...
متن کاملEquivalence and Lumpability of FSPNs
We consider equivalence relations for Fluid Stochastic Petri Nets (FSPNs). Based on equivalence relations for Stochastic Petri Nets (SPNs), which are derived from lumpability for Markov Chains, and from lumpability for certain classes of differential equations, we define an equivalence relation for FSPNs. Lumpability for the differential equations is based on a finite discretization approach an...
متن کاملLearning conditional preference networks
Conditional preference networks (CP-nets) have recently emerged as a popular language capable of representing ordinal preference relations in a compact and structured manner. In this paper, we investigate the problem of learning CP-nets in the well-known model of exact identification with equivalence and membership queries. The goal is to identify a target preference ordering with a binary-valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012